Playout policy adaptation with move features
نویسندگان
چکیده
منابع مشابه
Playout policy adaptation with move features
Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a playout policy online so as to improve MCTS for GGP. We also propose to learn a policy not only using the moves but also according to the features of the moves. We test the resulting algorithms named Playout Policy Adaptation (PPA) and Playout Policy Adaptation with move Featur...
متن کاملPlayout Policy Adaptation for Games
Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a playout policy online so as to improve MCTS for GGP. We test the resulting algorithm named Playout Policy Adaptation (PPA) on Atarigo, Breakthrough, Misere Breakthrough, Domineering, Misere Domineering, Go, Knightthrough, Misere Knightthrough, Nogo and Misere Nogo. For most of ...
متن کاملInteractivity-aware playout adaptation
Adaptive Playout is a solution in IP-based communication clients to compensate network issues using a dynamic receiver buffer. Whereas small buffers provoke loss artefacts due to delayed packets, large buffers result in high delay and loss of interactivity. Existing Voice over IP clients balance the trade-off between low delay and loss artefacts based on empirical values. Most often the degree ...
متن کاملMemorizing the Playout Policy
Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). Playout Policy Adaptation with move Features (PPAF) is a state of the art MCTS algorithm that learns a playout policy online. We propose a simple modification to PPAF consisting in memorizing the learned policy from one move to the next. We test PPAF with memorization (PPAFM) against PPAF and UCT fo...
متن کاملMulti-engine ASP solving with policy adaptation
The recent application of Machine Learning techniques to the Answer Set Programming (ASP) field proved to be effective. In particular, the multi-engine ASP solver me-asp is efficient: it is able to solve more instances than any other ASP system that participated to the 3rd ASP Competition on the “System Track” benchmarks. In the me-asp approach, classification methods inductively learn off-line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.06.024